#include<bits/stdc++.h>
using namespace std;
long long n,a[100009],h[100009],sum;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    sum=n;
    for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){
        int pos=upper_bound(a+1,a+n+1,a[i])-a;
        while(h[pos]==1){
            pos++;
        }
        if(pos<=n) h[pos]=1,sum--;
    }
    cout<<sum;
    return 0;
}
